Message Complexity of Hierarchical Quorum Consensus Algorithm
نویسندگان
چکیده
The hierarchical quorum consensus (HQC) algorithm, which is a generalization of the standard quorum consensus algorithm for managing replicated data, can reduce the quorum size to NO.‘j”. This paper analyzes the message complexity of HQC. Moreover, an asymptotic analysis on the ratio of the message complexity to the quorum size is presented. It is shown that the ratio converges to a constant.
منابع مشابه
A One-Phase Algorithm to Detect Distributed Deadlocks in Replicated Databases
Replicated databases that use quorum-consensus algorithms to perform majority voting are prone to deadlocks. Due to the P-out-of-Q nature of quorum requests, deadlocks that arise are generalized deadlocks and are hard to detect. We present an efficient distributed algorithm to detect generalized deadlocks in replicated databases. The algorithm performs reduction of a distributed waitfor-graph (...
متن کاملA Delay-Optimal Quorum-Based Mutual Exclusion Algorithm for Distributed Systems
ÐThe performance of a mutual exclusion algorithm is measured by the number of messages exchanged per critical section execution and the delay between successive executions of the critical section. There is a message complexity and synchronization delay trade-off in mutual exclusion algorithms. The Lamport algorithm and the Ricart-Agrawal algorithm both have a synchronization delay of T (T is th...
متن کاملA Delay-Optimal Quorum-Based Mutual Exclusion Scheme with Fault-Tolerance Capability
The performance of a mutual exclusion algorithm is measured by the number of messages exchanged per critical section execution and the delay between successive executions of the critical section. There is a message complexity and synchronization delay trade-oo in mutual exclusion algorithms. Lamport's algorithm and Ricart-Agrawal algorithm both have a synchronization delay of T, but their messa...
متن کاملConsensus Action Games
We present Consensus Action Games (CAGs), a novel approach to modelling consensus action in multi-agent systems inspired by quorum sensing and other forms of decision making found in biological systems. In a consensus action game, each agent’s degree of commitment to the joint actions in which it may participate is expressed as a quorum function, and an agent is willing to participate in a join...
متن کاملAn Improved Quorum-Based Algorithm for Extended GME Problem in Distributed Systems
The extended GME (group mutual exclusion) problem is a natural extension of the GME problem. In extended GME problem, processes are allowed to request more than one resource at a time, in order that the processes that can proceed by having access to any one of the requested resource can be allowed to do so. Manabe-Park suggested a quorum based solution for the extended GME problem. However, the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 50 شماره
صفحات -
تاریخ انتشار 1994